Cryptographically strong permutations from the butterfly structure

Efficient Construction of Cryptographically Strong Elliptic Curves

How To Generate Cryptographically Strong Sequences

Much effort has been devoted in the second half of this century to make precise the notion of Randomness. Let us informally recall one of these definitions due to Kolmogorov []. A sequence of bits A =all a2••.•• at is random if the length of the minimal program outputting A is at least k We remark that the above definition is highly non constructive and rules out the possibility of pseudo rando...

On the Generation of Cryptographically Strong Elliptic Curves

We discuss two methods for generating cryptographically strong elliptic curves deened over nite prime elds. The advantages and disadvantages of these algorithms are discussed and a practical comparison of the algorithms is given.

On the Difficulty of Constructing Cryptographically Strong Substitution Boxes

Two signi cant recent advances in cryptanalysis, namely the di erential attack put forward by Biham and Shamir [BS91] and the linear attack by Matsui [Mat94a, Mat94b], have had devastating impact on data encryption algorithms. An eminent problem that researchers are facing is to design S-boxes or substitution boxes so that an encryption algorithm that employs the S-boxes is immune to the attack...

Cryptographically Strong Undeniable Signatures, Unconditionally Secure for the Signer

"Undeniable" (or perhaps rather "invisible") signatures are digital signatures which the recipient cannot show round without the help of the signer. If forced to either acknowledge or deny a signature, however, the signer cannot deny it if it is authentic. We present the first undeniable signature scheme which is unconditionally secure for the signer (except for an exponentially small error pro...